N-flips in even triangulations on the sphere
نویسندگان
چکیده
A triangulation is said to be even if each vertex has even degree. For even triangulations, define the N -flip and the P2-flip as two deformations preserving the number of vertices. We shall prove that any two even triangulations on the sphere with the same number of vertices can be transformed into each other by a sequence of N and P2-flips.
منابع مشابه
Diagonal Flips in Hamiltonian Triangulations on the Sphere
In this paper, we shall prove that any two Hamiltonian triangulations on the sphere with n 5 vertices can be transformed into each other by at most 4n 20 diagonal flips, preserving the existence of Hamilton cycles. Moreover, using this result, we shall prove that at most 6n 30 diagonal flips are needed for any two triangulations on the sphere with n vertices to transform into each other.
متن کاملOn edge tricolorations of triangulations of simply connected surfaces
This paper studies the tricolorations of edges of triangulations of simply connected orientable surfaces such that the degree of each interior vertex is even. Using previous results on lozenge tilings, we give a linear algorithm of coloration for triangulations of the sphere, or of planar regions with the constraint that the boundary is monochromatic. We define a flip as a shift of colors on a ...
متن کاملN-flips in even triangulations on surfaces
a r t i c l e i n f o a b s t r a c t In this paper, we show that any two even triangulations on the same closed surface with the same and sufficiently large number of vertices can be transformed into each other by a sequence of two specifically defined deformations called an N-flip and a P 2-flip, up to homeomorphism, if they have the same homological structure.
متن کاملN-Flips in even triangulations on the projective plane
We shall show that any two even triangulations G and G on the projective plane with |V (G)| = |V (G)| ≥ 14 can be transformed into each other by two operations called an N -flip and P2-flip, if and only if both of them are simultaneously 3colorable, or not. c © 2007 Elsevier B.V. All rights reserved.
متن کاملDiagonal Flips in Labelled Planar Triangulations
A classical result of Wagner states that any two (unlabelled) planar triangulations with the same number of vertices can be transformed into each other by a finite sequence of diagonal flips. Recently Komuro gives a linear bound on the maximum number of diagonal flips needed for such a transformation. In this paper we show that any two labelled triangulations can be transformed into each other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 51 شماره
صفحات -
تاریخ انتشار 2006